Scheduling of parallel programs on configurable multiprocessors by genetic algorithms

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling of parallel programs on configurable multiprocessors by genetic algorithms

The scheduling of programs on parallel hardware is investigated in order to minimize the response time of the resulting system. In particular the scheduling problem considered in this paper includes—next to the search for an optimal mapping of the tasks and their sequence of execution—also the search for an optimal configurationof the parallel hardware. An approach for the simultaneous optimiza...

متن کامل

Task Scheduling on Configurable Parallel Systems by Genetic Algorithms

Computing the schedule on a configurable parallel system adds one dimension to the traditional scheduling problem. Besides determining the spatial mapping of tasks to processors and their execution order on the respective processors, additionally the topology of the parallel system has to be configured to best suite the application program. In order to acknowledge the mutual influence between s...

متن کامل

Static Task Scheduling for Configurable Multiprocessors

Our task scheduling pass implemented in the COINS compiler uses a Binary Linear Programming model for scheduling a program into a multiprocessor system-on-chip where each processor can be accelerated with instruction set extensions. We compare our work to state of the art approaches and estimate an average speedup of 4.01 in application execution time compared to a sequential approach. We estim...

متن کامل

arallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors

In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O ( e ) time complexity where e is the number of edges in the DAG. This linear-time algorithm works by first generating an initial solution and then r...

متن کامل

Automatic Parallelization and Scheduling of Programs on Multiprocessors using CASCH

The lack of a versatile software tool for parallel program development has been one of the major obstacles for exploiting the potential of high-performance architectures. In this paper, we describe an experimental software tool called CASCH (Computer Aided SCHeduling) for parallelizing and scheduling applications to parallel processors. CASCH transforms a sequential program to a parallel progra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 1998

ISSN: 0888-613X

DOI: 10.1016/s0888-613x(98)10001-4